Variable neighborhood descent with iterated local search for routing and wavelength assignment
نویسندگان
چکیده
منابع مشابه
Improved Construction Heuristics and Iterated Local Search for the Routing and Wavelength Assignment Problem
This paper deals with the design of improved construction heuristics and iterated local search for the Routing and Wavelength Assignment problem (RWA). Given a physical network and a set of communication requests, the static RWA deals with the problem of assigning suitable paths and wavelengths to the requests. We introduce benchmark instances from the SND library to the RWA and argue that thes...
متن کاملA hybrid iterated local search and variable neighborhood descent heuristic applied to the cell formation problem
The Cell Formation Problem is an NP-hard optimization problem that consists of grouping machines into cells dedicated to producing a family of product parts, so that each cell operates independently and inter-cellular movements are minimized. Due to its high computational complexity, several heuristic methods have been developed over the last decades. Hybrid methods based on adaptations of popu...
متن کاملVariable neighbourhood search for resolving routing and wavelength assignment problem in optical wavelength-division multiplexing networks
Since the issue of finding optimal signal routes imposes itself as one of the main challenges within the framework of optimal networks, this paper aims at illustrating the development of a new, mixed-integer mathematical model for solving the static routing and wavelength assignment (RWA) problem in optical WDM networks and presents the comparison of results obtained by heuristics and CPLEX com...
متن کاملSolving the Virtual Network Mapping Problem with Construction Heuristics, Local Search and Variable Neighborhood Descent
The Virtual Network Mapping Problem arises in the context of Future Internet research. Multiple virtual networks with different characteristics are defined to suit specific applications. These virtual networks, with all of the resources they require, need to be realized in one physical network in a most cost effective way. Two properties make this problem challenging: Already finding any valid ...
متن کاملIterated variable neighborhood search for the capacitated clustering problem
The NP-hard capacitated clustering problem (CCP) is a general model with a number of relevant applications. This paper proposes a highly effective iterated variable neighborhood search (IVNS) algorithm for solving the problem. IVNS combines an extended variable neighborhood descent method and a randomized shake procedure to explore effectively the search space. The computational results obtaine...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Operations Research
سال: 2012
ISSN: 0305-0548
DOI: 10.1016/j.cor.2011.10.022